On the distribution of winners’ scores in a round-robin tournament

نویسندگان

چکیده

In a classical chess round-robin tournament, each of $n$ players wins, draws, or loses game against the other $n-1$ players. A win rewards player with 1 points, draw 1/2 point, and loss 0 points. We are interested in distribution scores associated ranks after ${{n \choose 2}}$ games, that is, maximal score, second maximum, so on. The exact for general seems impossible to obtain; we obtain limit distribution.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global constraints for round robin tournament scheduling

In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-andbound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithm...

متن کامل

Constraint-based Round Robin Tournament Planning

Sport tournament planning becomes a complex task in the presence of heterogeneous requirements from teams, media, fans and other parties. Existing approaches to sport tournament planning often rely on precomputed tournament schemes which may be too rigid to cater for these requirements. Existing work on sport tournaments suggests a separation of the planning process into three phases. In this w...

متن کامل

An Improvement to MST Algorithm for Round-Robin Tournament Ranking

This paper improves the complexity of a newly introduced MST (Majority Spanning Tree) algorithm for ranking players of a round-robin tournament previously published.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability in the Engineering and Informational Sciences

سال: 2021

ISSN: ['1469-8951', '0269-9648']

DOI: https://doi.org/10.1017/s0269964821000267